package edu.cmu.cs211.proximitycounter.tests;

import edu.cmu.cs211.proximitycounter.counter.*;

public class TestUtil {
	
	public static int bruteForce(int r, Point[] points) {
		int total = 0;
		
		for (int i = 0; i < points.length; i++) {
		    for (int j = i+1; j < points.length; j++) {
		    	if (Math.abs(points[i].getX()-points[j].getX()) <= r && Math.abs(points[i].getY()-points[j].getY()) <= r) total++;
		    }
		}
		
		return total;
	 }
}
